A New DL-Lite N Bool Probabilistic Extension Using Belief

Dealing with uncertainty is a very important issue in description logics (DLs). In this paper, we present PrDL‐ Litebool N a new probabilistic extension of DL‐ Litebool N by supporting the belief interval in a single axiom or a set of axioms connected with conjunction (by ∧ ) or disjunction (by ∨ ) operators. The PrDL‐ Litebool N semantics is based on DL‐ Litebool N features which are a new alternative semantics for DL‐ Litebool N having a finite structure and its number is always finite unlike classical models. PrDL‐ Litebool N also supports terminological and assertional probabilistic knowledge and the main reasoning tasks: satisfiability, deciding the probabilistic axiom entailment and computing tight interval for entailment are achieved by solving linear constraints system. A prototype is implemented using OWL API for knowledge base creation, Pellet for reasoning and LpSolve for solving the linear programs.